Unfolding some classes of orthogonal polyhedra
نویسندگان
چکیده
In this paper, we study unfoldings of orthogonal polyhedra. More precisely, we deene two special classes of orthogonal polyhedra, orthostacks and orthotubes, and show how to generate unfoldings by cutting faces, such that the resulting surfaces can be attened into a single connected polygon.
منابع مشابه
Unfolding Genus-2 Orthogonal Polyhedra with Linear Refinement
We show that every orthogonal polyhedron of genus g ≤ 2 can be unfolded without overlap while using only a linear number of orthogonal cuts (parallel to the polyhedron edges). This is the first result on unfolding general orthogonal polyhedra beyond genus-0. Our unfolding algorithm relies on the existence of at most 2 special leaves in what we call the “unfolding tree” (which ties back to the g...
متن کاملGrid Vertex-Unfolding Orthogonal Polyhedra
An edge-unfolding of a polyhedron is produced by cutting along edges and flattening the faces to a net, a connected planar piece with no overlaps. A grid unfolding allows additional cuts along grid edges induced by coordinate planes passing through every vertex. A vertexunfolding permits faces in the net to be connected at single vertices, not necessarily along edges. We show that any orthogona...
متن کاملUnfolding and Reconstructing Polyhedra
This thesis covers work on two topics: unfolding polyhedra into the plane and reconstructing polyhedra from partial information. For each topic, we describe previous work in the area and present an array of new research and results. Our work on unfolding is motivated by the problem of characterizing precisely when overlaps will occur when a polyhedron is cut along edges and unfolded. By contras...
متن کاملUnfolding Lattice Polygons on Some Lattice Polyhedra∗
We consider the problem of unfolding lattice polygons embedded on the surface of some classes of lattice polyhedra. We show that an unknotted lattice polygon embedded on a lattice orthotube or orthotree can be convexified in O(n) moves and time, and a lattice polygon embedded on a lattice Tower of Hanoi or Manhattan Tower can be convexified in O(n) moves and time.
متن کاملUnfolding Orthogonal Polyhedra
Recent progress is described on the unsolved problem of unfolding the surface of an orthogonal polyhedron to a single non-overlapping planar piece by cutting edges of the polyhedron. Although this is in general not possible, partitioning the faces into the natural vertex-grid may render it always achievable. Advances that have been made on various weakenings of this central problem are summariz...
متن کامل